Abstract:

In computational geometry, determination of circle-circle and line-circle relationship are important problems. If the information of circle or line is supplied by different users and none of them would like to disclose his or her data to others, it is called the secure two-party circular computation problem. In this paper, a secure square of two numbers sum protocol, a secure two numbers relation determination protocol, a secure points distance computational protocol and a secure point-line distance computational protocol are proposed to solve the he circularity-circularity relation determination problem and line-circularity relation determination problem; the correctness, security and efficiency of these protocols are also analyzed

Key words: cryptograph, secure multi-party computation, secure geometry computation, additive homomorphic encryption, circularity